A Hyper-Heuristic Based on Random Gradient, Greedy and Dominance

نویسندگان

  • Ender Özcan
  • Ahmed Kheiri
چکیده

Hyper-heuristics have emerged as effective general methodologies that are motivated by the goal of building or selecting heuristics automatically to solve a range of hard computational search problems with less development cost. HyFlex is a publicly available hyper-heuristic tool for rapid development and research which provides an interface to four problem domains along with relevant low level heuristics. A multistage hyper-heuristic based on random gradient and greedy with dominance heuristic selection methods is introduced in this study. This hyperheuristic is implemented as an extension to HyFlex. The empirical results show that our approach performs better than some previously proposed hyper-heuristics over the given problem domains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation

Selection hyper-heuristics are randomised search methodologies which choose and execute heuristics from a set of low-level heuristics. Recent research for the LeadingOnes benchmark function has shown that the standard Simple Random, Permutation, Random Gradient, Greedy and Reinforcement Learning selection mechanisms show no effects of learning. The idea behind the learning mechanisms is to cont...

متن کامل

Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation

The allocation of fresh produce to shelf space represents a new decision support research area which is motivated by the desire of many retailers to improve their service due to the increasing demand for fresh food. However, automated decision making for fresh produce allocation is challenging because of the very short lifetime of fresh products. This paper considers a recently proposed practic...

متن کامل

Novel Hyper-heuristic Approaches in Exam Timetabling

This thesis presents an investigation into the use of hyper-heuristic approaches to construct and improve solutions for exam timetabling problems. The majority of the approaches developed in the literature operate on a space of potential solutions to a problem. However, a hyper-heuristic is a heuristic which acts on a space of heuristics, rather than a solution space directly. The majority of r...

متن کامل

Adaptive Selection of Heuristics within a GRASP for Exam Timetabling Problems

In this paper, we describe the development of a Greedy Random Adaptive Search Procedure (GRASP) where two low-level graph heuristics, Saturation Degree (SD) and Largest Weighted Degree (LWD) are dynamically hybridised in the construction phase to construct solutions for exam timetabling problems. The problem is initially solved using an intelligent adaptive LWD and SD graph hyper-heuristic whic...

متن کامل

A greedy gradient-simulated annealing selection hyper-heuristic

Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011